/*
 * @lc app=leetcode.cn id=2395 lang=golang
 *
 * [2395] 和相等的子数组
 */
package Solutions

// @lc code=start
func findSubarrays(nums []int) bool {
	var towSum = make(map[int]struct{}, len(nums))
	for i := 1; i < len(nums); i++ {
		t := nums[i-1] + nums[i]
		if _, ok := towSum[t]; ok {
			return true
		}
		towSum[t] = struct{}{}
	}
	return false
}

// @lc code=end
